Scheduling transmissions on channels in a wireless network

ABSTRACT

Allocation of resources in a wireless network are described where resources are allocated for data of each channel having a second parameter above zero prior to another channel&#39;s data for transmission having a third parameter less than or equal to zero. The second parameter may be derived from a first channel&#39;s first parameter and the third parameter is derived from a second channel&#39;s first parameter.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.13/858,666 filed Apr. 8, 2013, which is a continuation of U.S. patentapplication Ser. No. 13/212,843 filed Aug. 18, 2011, which issued asU.S. Pat. No. 8,428,026 on Apr. 23, 2013, which is a continuation ofU.S. patent application Ser. No. 11/430,421 filed May 8, 2006, whichissued as U.S. Pat. No. 8,005,041 on Aug. 23, 2011, the contents ofwhich are all incorporated by reference herein as if fully set forth.

FIELD OF THE INVENTION

This invention relates to a mechanism to support Internet Protocol dataflows within a wireless communication system. The invention isapplicable to, but not limited to, gateway queuing algorithms in packetdata transmissions, for example, for use in the universal mobiletelecommunication standard.

BACKGROUND OF THE INVENTION

In a cellular communication system, a geographical region is dividedinto a number of cells, each of which is served by base stations,sometimes referred to as Node-Bs. The base stations are interconnectedby a fixed network which can communicate data between the base stations.A mobile station, sometimes referred to as user equipment (UE) is servedvia a radio communication link from the base station of the cell withinwhich the mobile station is situated.

A typical cellular communication system extends coverage over an entirecountry and comprises hundreds or even thousands of cells supportingthousands or even millions of mobile stations. Communication from amobile station to a base station is known as the uplink, andcommunication from a base station to a mobile station is known as thedownlink.

The fixed network interconnecting the base stations is operable to routedata between any two base stations, thereby enabling a mobile station ina cell to communicate with a mobile station in any other cell. Inaddition, the fixed network comprises gateway functions forinterconnecting to external networks such as the Internet or the PublicSwitched Telephone Network (PSTN), thereby allowing mobile stations tocommunicate with landline telephones and other communication terminalsconnected by a landline. Furthermore, the fixed network comprises muchof the functionality required for managing a conventional cellularcommunication network including functionality for routing data,admission control, resource allocation, subscriber billing, mobilestation authentication etc.

Currently, the most ubiquitous cellular communication system is the 2ndgeneration communication system known as the Global System for Mobilecommunication (GSM). GSM uses a technology known as Time DivisionMultiple Access (TDMA) wherein user separation is achieved by dividingfrequency carriers into 8 discrete time slots, which individually can beallocated to a user. Further description of the GSM TDMA communicationsystem can be found in ‘The GSM System for Mobile Communications’ byMichel Mouly and Marie Bernadette Pautet, Bay Foreign Language Books,1992, ISBN 2950719007.

Currently, 3rd generation systems are being rolled out to furtherenhance the communication services provided to mobile users. The mostwidely adopted 3rd generation communication systems are based on CodeDivision Multiple Access (CDMA) technology. Both Frequency DivisionDuplex (FDD) and Time Division Duplex (TDD) techniques employ this CDMAtechnology. In CDMA systems, user separation is obtained by allocatingdifferent spreading and scrambling codes to different users on the samecarrier frequency and in the same time intervals. In TDD, additionaluser separation is achieved by assigning different time slots todifferent users similarly to TDMA. However, in contrast to TDMA, TDDprovides for the same carrier frequency to be used for both uplink anddownlink transmissions. An example of a communication system using thisprinciple is the Universal Mobile Telecommunication System (UMTS).Further description of CDMA and specifically of the Wideband CDMA(WCDMA) mode of UMTS can be found in ‘WCDMA for UMTS’, Harri Holma(editor), Antti Toskala (Editor), Wiley & Sons, 2001, ISBN 0471486876.

In a 3rd generation cellular communication system, the communicationnetwork comprises a core network and a Radio Access Network (RAN). Thecore network is operable to route data from one part of the RAN toanother, as well as interfacing with other communication systems. Inaddition, it performs many of the operation and management functions ofa cellular communication system, such as billing. The RAN is operable tosupport wireless user equipment over a radio link of the air interface.The RAN comprises the base stations, which in UMTS are known as Node Bs,as well as Radio Network Controllers (RNCs) which control the basestations and the communication over the air interface.

The RNC performs many of the control functions related to the airinterface including radio resource management and routing of data to andfrom appropriate base stations. It further provides the interfacebetween the RAN and the core network. An RNC and associated basestations are known as a Radio Network Subsystem (RNS).

3rd generation cellular communication systems have been specified toprovide a large number of different services including efficient packetdata services. For example, downlink packet data services are supportedwithin the 3GPP release 5 specifications in the form of the High SpeedDownlink Packet Access (HSDPA) service. A High Speed Uplink PacketAccess (HSUPA) feature is also in the process of being standardised.This uplink packet access feature will adopt many of the features ofHSDPA.

In accordance with the 3GPP specifications, the HSDPA service may beused in both Frequency Division Duplex (FDD) mode and Time DivisionDuplex (TDD) mode.

In HSDPA, transmission code resources are shared amongst users accordingto their traffic needs. The base station or “Node-B” is responsible forallocating and distributing the resources to the users, within aso-called scheduling task. Hence, for HSDPA, some scheduling isperformed by the RNC whereas other scheduling is performed by the basestation. Specifically, the RNC allocates a set of resources to each basestation, which the base station can use exclusively for high speedpacket services. The RNC furthermore controls the flow of data to andfrom the base stations.

Therefore, most packet based systems contain schedulers that controlwhen the individual data packets are transmitted, in order to share theavailable resource, whether time-slots in a time division multipleaccess (TDMA) communication system or power and codes in a code divisionmultiple access (CDMA) communication system. An introduction toschedulers can be found in ‘Service discipline for guaranteedperformance service in packet-switching networks’, authored by HuiZhang, and published in the Proceedings of the IEEE, volume 83, no. 10,October 1995.

U.S. Pat. No. 6,845,100 describes use of two separate schedulers; apacket scheduler and a QOS scheduler. The packet scheduler allocatesresources to users and then within this user's allocation the QoSscheduler prioritizes some packets over other depending upon the radiobearer they are assigned to.

Thus, there exists a need to provide an improved mechanism todifferentiate between IP data flows.

SUMMARY OF THE INVENTION

In accordance with aspects of the present invention, there is provided awireless communication system, an apparatus, and a method of operationtherefor, as defined in the claims.

Accordingly, in one embodiment of the present invention there isprovided an apparatus for use in allocating resource in a wirelesscommunication system, the apparatus comprising mapping logic arranged tomap one or more services to individual radio bearers of a plurality ofradio bearers; reporting logic arranged to indicate buffer occupancy forthe plurality of radio bearers; and prioritization logic arranged toprioritize the allocated resource across multiple wireless communicationunits on a radio bearer basis.

The provision of prioritization logic arranged to prioritize allocatedresource across multiple wireless communication units enablesprioritization of a particular service across users, so that forinstance hyper text transport protocol (HTTP) traffic can be prioritizedover file transfer protocol (FTP) traffic, whether the FTP traffic wasassociated with one user or a number of other users.

In one embodiment of the present invention, the apparatus comprises adatabase storing a plurality of service specifications, one per wirelesscommunication unit, that define the mapping between data flow andrespective radio bearers.

The provision of a database storing a plurality of servicespecifications provides a very wide range of mapping characteristics canbe configured. Furthermore, different mappings can be achieved on a pertier or even per user basis.

In one embodiment of the present invention, the apparatus furthercomprises signal dividing logic operably coupled to mapping logic andarranged to split services into individual radio bearers from a single(PDP) context.

The provision of the signal dividing logic provides user equipment withthe ability to no longer need to send a secondary packet data protocol(PDP) context request to begin a new service, thereby avoidingsignificant latency.

In one embodiment of the present invention, the wireless communicationunit is user equipment arranged to allocate resource in an uplinkcommunication path.

In one embodiment of the present invention, the apparatus is located ina radio access network (RAN) that comprises prioritization logicarranged to allocate resource to a plurality of wireless communicationunits in a downlink communication path on a radio bearer basis.

In one embodiment of the present invention, a wireless communicationunit of the plurality of wireless communication units comprises a signalprocessor arranged to identify buffer occupancy for individual radiobearers and a transmitter operably coupled to the signal processor andarranged to transmit a message to the radio access network.

The provision of a signal processor arranged to identify bufferoccupancy for individual radio bearers (or services) advantageouslyenables any system to provide prioritization, whether within a usersallocation or across users. In one embodiment of the present inventionthe message indicates separate buffer occupancy for each of the radiobearers.

The provision of a message that indicates separate buffer occupancy foreach of the individual radio bearers provides effective prioritization,in that the allocator knows the buffer occupancy for each radio bearer(RB), in the UL direction. This supports signalling to enable the UE toreport this volume.

In one embodiment of the present invention, the apparatus furthercomprises weighting logic operably coupled to the signal processor andthe prioritization logic and arranged to provide a set of weight valuesfor each service across a plurality of users such that theprioritization logic allocates bandwidth resource to individual radiobearers according to a set of weight values.

The provision of weighting logic operably coupled to the signalprocessor and the prioritization logic allows a proportion of theresource to be allocated to particular radio bearers (e.g. services).This is in contrast to the conventional prioritization scheme providedby 3GPP, which uses a simple absolute priority scheme.

In one embodiment of the present invention, the apparatus furthercomprises a transmitter transmitting the set of weight values to thewireless communication unit. This feature provides the advantage thatthe UE can then properly prioritize traffic whilst receiving a singlephysical allocation from the network and not have to use the simpleabsolute priority system defined in 3GPP.

In one embodiment of the present invention, the radio access networkcomprises a scheduler arranged to schedule prioritized allocatedresource across multiple wireless communication units in response to themessage.

In one embodiment of the present invention, the radio access networkcomprises a plurality of classifiers associated with the one or moreservices operably coupled to the mapping logic such that the mappinglogic maps data packets onto respective radio bearers.

The provision of classifiers associated with the one or more servicesadvantageously supports the filtering of services onto radio bearers.

In one embodiment of the present invention, there is provided anapparatus comprising a memory and a processor operably coupled to thememory. Program code is executable on the processor, where the programcode is operable for mapping one or more services to individual radiobearers of a plurality of radio bearers; reporting buffer occupancy forthe plurality of radio bearers; and prioritizing the allocated resourceacross multiple wireless communication units on a radio bearer basis.

In one embodiment of the present invention, a wireless communicationsystem comprises a radio access network facilitating communication to aplurality of wireless communication units. The wireless communicationsystem comprises mapping logic arranged to map one or more services toindividual radio bearers of a plurality of radio bearers; reportinglogic arranged to indicate buffer occupancy for the plurality of radiobearers; and prioritization logic arranged to prioritize the allocatedresource across multiple wireless communication units on a radio bearerbasis.

In one embodiment of the present invention, a method for limiting anumber of services supported at an instant of time in a wirelesscommunication system is described. The method comprises determining anormalised service weighting parameter of allocated resources;determining a number of resource allocation units allocated to eachservice; and determining whether the number of services that haveresources allocated is greater than a threshold. The method furthercomprises limiting a number of resource allocation units allocated inresponse to the number of services that have resources allocated isgreater than a threshold; re-calculating a number of resource allocationunits allocated to each service; and ordering services in an order ofresource allocation units allocated to each service, and select a numberfrom the ordered services. The method further comprises setting allservices not selected to zero; determining whether the number ofservices that have resources allocated is greater than a threshold; andwhen said number of services that have resources allocated is greaterthan the threshold, repeating said steps of re-calculating, ordering,setting and determining.

In this manner, even when a large population of users exist, each withmany services, the number of messages required to allocate the overallresource is limited to a manageable number. It is noteworthy that asingle user with multiple services, each allocated resource, will onlyresult in a single allocation message. However, by having large numbersof users with large numbers of services the chance of allocating a smallamount of resource to many users is increased.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments of the invention will be described, by way of example only,with reference to the accompanying drawings, in which

FIG. 1 illustrates a 3GPP cellular communication system capable ofsupporting embodiments of the present invention;

FIG. 2 illustrates a downlink operation to allow service prioritizationacross a plurality of users according to embodiments of the presentinvention;

FIG. 3 illustrates an example of a mechanism whereby UEs are mapped toradio bearers according to embodiments of the present invention;

FIG. 4 illustrates a tier-based weighted fair queuing system that can beutilised in embodiments of the present invention;

FIG. 5 illustrates a communication system comprising uplink scheduling,in accordance with some embodiments of the invention; and

FIG. 6 illustrates a method to limit a number of services/queues to beallocated radio bearers at a particular instant in time, in accordancewith embodiments of the invention.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

In summary, embodiments of the present invention describe anarchitecture for supporting IP flows with different quality of servicewithin a wireless communications system. Embodiments of the presentinvention comprise a database carrying service specifications, one peruser equipment, which define the mapping between IP flows and radiobearers. At the user equipment, and within the Radio Access Network,classifiers use the specifications to map IP packets onto theappropriate radio bearers. A scheduler within the Radio Access Networkis configured to allocate bandwidths to the different radio bearers,according to a set of weights values. Thus, in this manner, quality ofservice (QoS) differentiation between different services carried over IPover the wireless network is achieved.

RAN functionality already assumes that data associated with separateservice definition specifications (e.g. port numbers) is placed onseparate radio bearers. However, in embodiments of the presentinvention, the RAN functionality is configured to allow services to beprioritized across multiple users, in contrast to prior art techniquesthat only allow prioritization within a user's allocation.

Referring firstly to FIG. 1, a typical, standard UMTS Radio AccessNetwork (UTRAN) system 100 is conveniently considered as comprising:terminal/user equipment domain 110; a UMTS Terrestrial Radio AccessNetwork domain 120; and an infrastructure domain 130.

In the terminal/user equipment domain 110, terminal equipment (TE) 112is connected to mobile equipment (ME) 114 via the wired or wireless Rinterface. The ME 114 is also connected to a user service identitymodule (USIM) 116; the ME 114 and the USIM 116 together are consideredas user equipment (UE) 118. The UE may be for example a remote unit, amobile station, a communication terminal, a personal digital assistant,a laptop computer, an embedded communication processor or anycommunication element communicating over the air interface of thecellular communication system.

The UE 118 communicates data with a Node-B (base station) 122 in theradio access network domain 120 via the wireless Uu interface. Withinthe radio access network domain 120, the Node-B 122 communicates with aradio network controller (RNC) 124 via the Iub interface. The RNC 124communicates with other RNCs (not shown) via the Iur interface.

The Node-B 122 and the RNC 124 together form the UTRAN 126. The RNC 124communicates with a serving GPRS service node (SGSN) 132 in the corenetwork domain 130 via the Iu interface. Within the core network domain130, the SGSN 132 communicates with a gateway GPRS support node 134 viathe Gn interface; the SGSN 132 and the GGSN 134 communicate with a homelocation register (HLR) server 136 via the Gr interface and the Gcinterface respectively. The GGSN 134 communicates with public datanetwork 138 via the Gi interface.

Thus, the elements RNC 124, SGSN 132 and GGSN 134 are conventionallyprovided as discrete and separate units (on their own respectivesoftware/hardware platforms) divided across the radio access networkdomain 120 and the core network domain 130, as shown FIG. 1.

The RNC 124 is the UTRAN element responsible for the control andallocation of resources for numerous Node-Bs 122; typically 50 to 100Node-Bs may be controlled by one RNC. The RNC also provides reliabledelivery of user traffic over the air interfaces. RNCs communicate witheach other (via the Iur interface).

The SGSN 132 is the UMTS Core Network element responsible for SessionControl and interface to the HLR. The SGSN keeps track of the locationof an individual UE and performs security functions and access control.The SGSN is a large centralised controller for many RNCs.

The GGSN 134 is the UMTS Core Network element responsible forconcentrating and tunneling user data within the core packet network tothe ultimate destination (e.g., internet service provider—ISP). Terminalequipment (TE) 112 is connected to mobile equipment (ME) 114 via thewired or wireless R interface. The ME 114 is also connected to a userservice identity module (USIM) 116; the ME 114 and the USIM 116 togetherare considered as user equipment (UE) 118. The UE 118 communicates datawith a Node-B (base station) 122 in the radio access network domain 120via the wireless Uu interface. Within the radio access network domain120, the Node-B 122 communicates with a radio network controller (RNC)124 via the Iub interface. The RNC 124 communicates with other RNCs (notshown) via the Iur interface. The Node-B 122 and the RNC 124 togetherform the UTRAN 126. The RNC 124 communicates with a serving GPRS servicenode (SGSN) 132 in the core network domain 130 via the Iu interface.Within the core network domain 130, the SGSN 132 communicates with agateway GPRS support node 134 via the Gn interface; the SGSN 132 and theGGSN 134 communicate with a home location register (HLR) server 136 viathe Gr interface and the Gc interface respectively. The GGSN 134communicates with public data network 138 via the Gi interface.

Thus, the elements RNC 124, SGSN 132 and GGSN 134 are conventionallyprovided as discrete and separate units (on their own respectivesoftware/hardware platforms) divided across the radio access networkdomain 120 and the core network domain 130, as shown FIG. 1.

The RNC 124 is the UTRAN element responsible for the control andallocation of resources for numerous Node-Bs 122; typically 50 to 100Node-Bs may be controlled by one RNC. The RNC 124 also provides reliabledelivery of user traffic over the air interfaces. RNCs communicate witheach other (via the Iur interface).

The SGSN 132 is the UMTS Core Network element responsible for SessionControl and interface to the HLR. The SGSN keeps track of the locationof an individual UE and performs security functions and access control.The SGSN is a large centralised controller for many RNCs.

The GGSN 134 is the UMTS Core Network element responsible forconcentrating and tunneling user data within the core packet network tothe ultimate destination (e.g., internet service provider—ISP).

Such a UTRAN system and its operation are described more fully in the3rd Generation Partnership Project technical specification documents3GPP TS 25.401, 3GPP TS 23.060, and related documents, available fromthe 3GPP website at www.3gpp.org, and need not be described herein inmore detail.

Within the RNC 124, separate functional blocks exist that have beenincorporated or adapted in accordance with embodiments of the presentinvention. In particular, as shown in FIG. 1, a Mapper 128 isresponsible for mapping IP packets to separate RBs. The Mapper 128 isshown in greater detail in FIG. 2. A scheduler 129 is responsible forallocating a certain proportion of the radio resource to each of theRBs, which is described in further detail with respect to FIG. 3 andFIG. 4.

Additionally, in accordance with embodiments of the present invention,element manager logic 140 has been incorporated into the system, whichis used to contain the database that defines the mapping characteristicsfor IP packets to RBs. The element manager logic 140 also contains thevalues of the queue weighting parameters, Stier, as described in moredetail later.

FIG. 2 illustrates a downlink operation according to one embodiment ofthe present invention that may allow service prioritization across aplurality of users. In this regard, processing logic 128 within the RNCcomprises signal dividing logic 215, which splits services 220, 225, 230into separate radio bearers 235, 240, 245 from a single PDP context 205.In one embodiment of the present invention, the services may be dividedbetween separate radio bearers based on, say, port numbers.

Although eight services/radio bearers are illustrated in FIG. 2, it isenvisaged that the inventive concept may be applied to any number ofservices/radio bearers. In this manner, for each user, the scheduler isnow aware of the total amount of data present in buffers for eachservice.

FIG. 3 illustrates an example of a mechanism whereby a plurality of UEsis mapped to radio bearers according to embodiments of the presentinvention. In this example, a first UE 315, a second UE 320 and a thirdUE 335 are illustrated, whereby the first UE 315 and second UE 320 use afirst service level agreement (SLA-1) 305 and the third UE 335 uses asecond (SLA-2) 345. The first SLA-1 305 and the second SLA-2 345 employa plurality of radio bearers that they organise packet data queues for.

In one embodiment of the present invention, it is envisaged thatseparate queues may be provided for the same services, but usingdifferent SLAs.

Referring now to FIG. 4, resource allocator logic associated with asingle SLA is shown, i.e. FIG. 4 provides a more detailed version ofelement 305 in FIG. 3. Separate reports 410, 430, 460 for RBs ‘1’ to ‘8’are provided and these are associated with separate services within anSLA.

In one embodiment of the present invention, within each queue there is asingle indication of the volume of data for each user (for theassociated radio bearer) 420, 440, 470 rather than the data itself.Within each queue a simple round robin allocation scheme may operate,whereby when the volume indication reaches the head of the queue a fixedvolume of resource is allocated to the user. When the user has beengranted this resource, the user is placed at the back of the queue(assuming there is still buffer occupancy left for this user given theresource that has been allocated).

The output from the respective queues provides individual indications ofan allocation for each logical channel to the UTRAN side medium accesslayer (MAC). The outputs are combined in a scheduler 480 that provides aDL allocation that is sent to the respective UEs in a physical sharedchannel allocation message.

With reference to FIG. 4, the above scheme may be supported in amechanism that provides ‘tier-based, weighted fair queuing’. Briefly, insuch a mechanism, each queue determines the weight value based on:

$\begin{matrix}{W_{tier}^{\prime} = \frac{N_{tier}*S_{tier}}{\sum\limits_{alltiers}\; \left( {N_{tier}*S_{tier}} \right)}} & \lbrack 1\rbrack\end{matrix}$

Where:

N_(tier) is the number of separate users in the queue.

The overall volume of spare physical resource is then allocated to eachqueue in proportion to the W'tier values. As mentioned previously, asimple round robin allocation policy may also apply within each queue.

Referring back to FIG. 3 a total of 16 queue weights (S_(tier)) aredesired. These queue weights define the relative amount of the totalresource that is allocated to each queue. Thus, the bandwidth allocatedto different radio bearers is shared according to the relative weights.In the implementation, these weights are set by the element manager.However, in one embodiment of the present invention, the weights mayalso be configured by RADIUS, in which case the service specification isinterpreted by the radio resource manager (RRM) to configure appropriateresource allocation (RA) queues and RBs.

The structure of this architecture means that it is possible to provideQoS prioritization across multiple users. Hence, for example, in ascenario where there are two users, one may have hyper-text transferprotocol (HTTP) traffic and this may be mapped to RB1, and a second usermay employ file transfer protocol (FTP) traffic, which may be mapped toRB2. The S_(tier) associated with RB1 (S_(tier 1)) is higher than thatfor RB2 (S_(tier 2)). Therefore, assuming the volume of data in thebuffers for the 2 users is the same, then the ratio of the totalresource allocated to RB1 may be defined as:

S _(tier 1)/(S _(tier 1) +S _(tier 2))  [3]

Thus, the ratio of the total resource allocated to RB2 may be definedas:

S _(tier 2)/(S _(tier 1) +S _(tier 2))  [4]

It is noteworthy that there is no restriction on the values associatedwith each queue weight value (S_(tier)). Therefore, in accordance withembodiments of the present invention, it may be possible to, say, setthe relative weight for service 1 for SLA-2 to be higher than a numberof services on SLA-1, which may nominally be a higher-priority SLA.

In accordance with one embodiment of the present invention, a mechanismto provide prioritization of services across multiple users in an uplinkdirection is described. In this regard, weight values are signaled tothe UE. Again, as described above with respect to a downlink direction,it is assumed that logic exists that splits data onto a number of radiobearers dependent on the type of service. It is also assumed that the UEis able to signal to the network separate buffer occupancy for eachqueue associated with the various RBs.

If there are multiple QoS requirements within a single 3GPP PDP context,a single physical allocation of radio resources may be made to the UE.In this manner, a single PDP context implies a single CCTrCh. Thissingle physical allocation of radio resources provided to a UE is sharedamongst a number of services, in proportion to their respective QoSrequirements, for example in proportion to the signalled weight values(S_(tier)).

The network knows separate buffer occupancies associated with each RB.Therefore, the logic required to operate the uplink case is largelyunchanged compared with the aforementioned downlink case. However, asonly a single physical allocation is signaled to the UE, all thephysical allocations associated with each queue are summed together. Inthis regard, this mechanism is unlike the downlink case where directcontrol of which RB is allocated physical resources is implemented.

In the uplink case, as a single physical allocation is used, thescheduler logic in the network is mirrored with similar scheduler logicin the UE, which takes the single physical allocation and splits itbetween different RBs using the weight, S_(tier), values. In addition,in order for the UE to know the value of the S_(tier) parameters thatare also used at the network side, the uplink case supports signalingbetween the network and UE to communicate these values.

In one embodiment of the present invention, the signaling of theS_(tier) parameters will typically be sent to the UE when it initiallyconnects to the network (for example in the radio bearer setup message).If there are any modifications to the S_(tier) parameters then these maybe typically signaled to the UE in dedicated control signaling (using,for example, a radio bearer reconfiguration message). However, it isalso envisaged that S_(tier) parameters could also be signaled to the UEusing other mechanisms, such as system information.

Referring now to FIG. 5, an overview of the communication between an UE505 and the UTRAN 540 to support an uplink scenario is illustrated. Inthis regard, the UE 505 may receive a single PDP context 510 and splitthe single PDP context 510 into separate services on individual radiobearers in divider logic 515. The UE may then transmit a message 535indicating separate buffer occupancy for each of the radio bearers to aUTRAN scheduler 545.

The separate services on individual radio bearers are input to a UEmirror scheduler 525. In one embodiment of the present invention, the UEmirror scheduler 525 receives a S_(tier) parameter 550 signalled 555from the UTRAN 540 when the UE first connects to the UTRAN 540. TheS_(tier) parameters 550 within the UTRAN 540 are also input to the UTRANscheduler 545. The UTRAN scheduler 545 is adapted to provide a singleallocation of a physical resource to the UE mirror scheduler 525 withinmessage 560. The UE mirror scheduler 525 is then able to inform theUTRAN 540 in a message 535 on its use of the physical allocation, inorder to transmit data in each radio bearer in proportion to theinformed S_(tier) parameters 550.

Thus, within the UE 505, the S_(tier) values are known, together withthe total allocation of resources for the UE 505. Clearly there is onlya single SLA at the UE, and N_(tier) can be either a ‘0’ or ‘1’. Thus,and advantageously, the overall resources allocated by the network arenow split up based on the relative values of W'tier.

Furthermore, it is noteworthy that, the aforementioned structure allowsthe ability to prioritize QoS across users in the DL to be extended tothe UL.

As each SLA is can now be split into multiple RBs it may be the casethat very small proportions of the overall resources are allocated toeach RB. This may create signalling problems, as the mechanism mayresult in a large number of individual users being allocated someresource at any one time and each user will require a separateallocation message. Therefore, in an enhanced embodiment of the presentinvention, a mechanism to implement additional functionality to limit atotal number of queues served, e.g. to be allocated resource allocationunits, is described. Thus, this algorithm limits a number queues thatcan be allocated resource at any one instance, for example to anoperator-specified value. The algorithm may also ensure that the ratioof allocated resource is maintained, over the long term, to the ratiosspecified by the Stier values.

It is noteworthy that this algorithm can be implemented in both theuplink and downlink.

Referring now to FIG. 6, an algorithm 600 employing embodiments of thepresent invention is illustrated. The algorithm describes one mechanismto limit a number of queues served at a single instant of time. Thealgorithm may be run when a number of active users (i.e. those usersknown to have a buffer occupancy greater than zero in any queue) isgreater than a known fixed parameter, for example‘max_number_queues_serviced’, as defined by the Element Manager (EM).

The process commences in step 605 by determining a normalised queueweighting parameter W'q of the allocated resources:

$\begin{matrix}{W_{q}^{\prime} = \frac{N_{q}*S_{q}}{\overset{{NB\_ q} - 1}{\sum\limits_{q = 0}}\; \left( {N_{q}*S_{q}} \right)}} & \lbrack 6\rbrack\end{matrix}$

Where:

N_(Q) is the number of entries in queue Q (i.e. the number of UEs withdata in queue q); and

NB_q is the number of queues configured at the Node-B.

The process then determines, as shown in step 610, the number of RAAUallocated to each queue, for example using:

RAAUq=FreeRAAU*W' _(q)  [7]

Where:

RAAU represents a quantum of physical resource (codes and timeslots);and

FreeRAAU is a number of free RAAU that the resource allocator (RA) canshare out.

The algorithm may then determine whether the number of queues that haveresources allocated greater than the EMparameter—max_number_queues_serviced, as shown in step 615. If thenumber of queues that have resources allocated is greater than athreshold, for example the EM parameter max_number_queues_serviced, theprocess moves to step 620. If the number of queues that have resourcesallocated is not greater than the EM parametermax_number_queues_serviced then the process may operate as normal asdescribed in the PCT publication WO 03/049320, by the same Applicant asthe present invention.

Step 620 re-calculates RAAUq as follows:

RAAUq′=RAAUq+running_RAAU_delta  [8]

Where:

RAAUq is calculated in step 610, and

running_RAAU_delta is the running difference between the number of RAAUthat would be allocated without the limitation of the number of queuesserviced and the number of RAAU allocated with the limitation.

Note that this algorithm is iterative and running_RAAU_delta isdetermined from the previous iteration of the algorithm. Hence, althoughno limitation has been applied in the first iteration, on the seconditeration the limitation of the number of queues in the previousiteration has meant that there are some queues that did not receive thenumber of RAAU that were originally determined.

In step 625, the queues are then ordered in order of RAAUq′, beginningwith the highest queue. The first max_number_queues_serviced queues arethen selected, as shown in step 628.

In all queues not selected in step 628, the Nq′ value is set to zero, asshown in step 630. In all of the tiers that were selected in step 628,Nq′ is set to Nq, as shown in step 635.

In step 640, Wq (now known as W″_(q)) may be re-calculated using the Nq′vector determined in step 635, for example using:

$\begin{matrix}{W_{q}^{''} = \frac{N_{q}^{\prime}*S_{q}}{\overset{{NB\_ q} - 1}{\sum\limits_{q = 0}}\; \left( {N_{q}^{\prime}*S_{q}} \right)}} & \lbrack 10\rbrack\end{matrix}$

The modified number of RAAU, allocated to each queue, may then bedetermined in step 645. For example, the modified number may bedetermined using:

RAAUq″=round(FreeRAAU*W″q)  [11]

where: round ( . . . ) rounds to the nearest integer.

The sum of all RAAU allocated may then be determined in step 650. Here,if the sum of all RAAU allocated is greater than freeRAAU (which ispossible following the rounding operation in step 645) then the RAAUq″may be modified in step 655, as also described in the PCT publication WO03/049320, by the same Applicant as the present invention.

It is possible that the volume of resource allocated to the queue may beless than that required given the cell edge state that the UE is in. Forexample, if the UE is in cell edge ‘2’ then four RAAU will be needed asa minimum. Therefore, if the amount of RAAU allocated by RAAU tier″ isless than the minimum required RAAU, given the cell edge state for anyq, then RAAUq″ may be set for one of the queues that has RAAUq″ lessthan the minimum to zero, as shown in step 660. Here, it is noteworthythat there may be multiple queues below the minimum.

In this scenario, any spare resources are allocated first to any otherqueues that are below the minimum, as shown in step 665. If there arestill spare resources, then any spare resources are allocated in turn;one RAAU each to the queues that currently have RAAUq″ greater thanzero.

The RAAUq″ value is then updated, as shown in step 670. The runningdifference, between the actually allocated RAAU (RAAUq″) and theoriginally determined allocated RAAU RAAUq, is then updated, as shown instep 675. For example, in this manner:

running_RAAU_delta:=running_RAAU_delta+(RAAUq−RAAUq″)  [12]

Thus, a mechanism is described whereby the number of queues to beallocated resources at any particular time may be limited.

In summary, the inventive concept of the present invention aims toprovide at least one or more of the following features:

-   -   (i) A method to provide prioritization of services across users        in the DL;    -   (ii) A method to provide prioritization of services across users        in the UL. This requires that weight values are signalled to the        UE;    -   (iii) A method to limit the number of queues (i.e. services) to        be allocated radio resources at any one time. This functionality        is provided in the UL as well as the DL; and    -   (iv) The inventive concept of the present invention enables        prioritization of packet types across users, as there is a        single allocation process for each packet type and each user.        This is particularly beneficial for packet-based, best-effort        services. For instance, if a wireless communication system        comprises a plurality of users that are performing very large        file transfer protocol (FTP) downloads, and another user is web        browsing, it is possible to prioritize the web browsing user        over the others.

It is noteworthy that U.S. Pat. No. 6,845,100 is significantly differentfrom the inventive concept herein described, which proposes a mechanismthat is able to prioritize packet types across users. In one embodiment,this is achieved through provision of a single allocation process foreach packet type and each user. This is particularly beneficial forpacket based best-effort services. For instance if a first number ofusers are performing very large file transfer protocol (FTP) downloads,and another user is web browsing, it is possible to prioritize the webbrowsing user amongst others, in employing the inventive concept hereindescribed, in contrast to the known prior art, such as U.S. Pat. No.6,845,100, which will not allow this to happen.

In particular, it is envisaged that the aforementioned inventive conceptcan be applied by a semiconductor manufacturer to any signal processingintegrated circuit (IC). It is further envisaged that, for example, asemiconductor manufacturer may employ the inventive concept in a designof a stand-alone device, or application-specific integrated circuit(ASIC) and/or any other sub-system element.

It will be appreciated that any suitable distribution of functionalitybetween different functional units or logic elements, may be usedwithout detracting from the inventive concept herein described. Hence,references to specific functional devices or elements are only to beseen as references to suitable means for providing the describedfunctionality, rather than indicative of a strict logical or physicalstructure or organization.

Aspects of the invention may be implemented in any suitable formincluding hardware, software, firmware or any combination of these.Software and firmware may be stored on computer-readable media. Theelements and components of an embodiment of the invention may bephysically, functionally and logically implemented in any suitable way.Indeed, the functionality may be implemented in a single unit or IC, ina plurality of units or ICs or as part of other functional units.

Although the present invention has been described in connection withsome embodiments, it is not intended to be limited to the specific formset forth herein. Rather, the scope of the present invention is limitedonly by the claims. Additionally, although a feature may appear to bedescribed in connection with particular embodiments, one skilled in theart would recognize that various features of the described embodimentsmay be combined in accordance with the invention. Further, althoughembodiments of the present invention may be described, in someinstances, using terminology from a particular protocol, those skilledin the art will recognize that such terms are also used in a genericsense herein, and that, unless otherwise specified, the presentinvention is not limited to systems implementing a particular protocol.In the claims, the term ‘comprising’ does not exclude the presence ofother elements or steps.

Furthermore, although individual features may be included in differentclaims, these may possibly be advantageously combined, and the inclusionin different claims does not imply that a combination of features is notfeasible and/or advantageous. Also, the inclusion of a feature in onecategory of claims does not imply a limitation to this category, butrather indicates that the feature is equally applicable to other claimcategories, as appropriate.

Furthermore, the order of features in the claims does not imply anyspecific order in which the features must be performed and in particularthe order of individual steps in a method claim does not imply that thesteps must be performed in this order. Rather, the steps may beperformed in any suitable order. In addition, singular references do notexclude a plurality. Thus, references to “a”, “an”, “first”, “second”etc. do not preclude a plurality.

Thus, an improved wireless communication system, apparatus, integratedcircuit, and a method of operation therefor have been described, whereinthe aforementioned disadvantages with prior art arrangements have beensubstantially alleviated.

What is claimed is:
 1. A user equipment (UE) comprising: a receiverconfigured to receive, from a network device, a first signal including afirst parameter corresponding to each of a plurality of channels and asecond signal including an allocation message for an uplink resourcefrom the network device; a processor configured to allocate resources inresponse to the allocation message, wherein resources are allocated fordata of each channel having a second parameter above zero prior toanother channel's data for transmission having a third parameter lessthan or equal to zero; and wherein the second parameter is derived froma first channel's first parameter and the third parameter is derivedfrom a second channel's first parameter.
 2. The UE of claim 1 furthercomprising: a transmitter further configured to transmit a third signalincluding a plurality of indications of buffer occupancies associatedwith the plurality of channels.
 3. The UE of claim 1, wherein the secondparameter is derived by multiplying the first channel's first parameterwith a fourth parameter and the third parameter is derived bymultiplying the second channel's first parameter with the fourthparameter.
 4. A network device comprising: a transmitter configured totransmit, to a user equipment (UE), a first signal including a firstparameter for each of a plurality of channels; the transmitter furtherconfigured to transmit a second signal including an allocation messagefor an uplink resource; a receiver configured to receive a third signalincluding data from the plurality of channels in response to theallocation message, wherein allocation of resources for the data of eachchannel having a second parameter above zero is provided prior toanother channel's data for transmission having a third parameter lessthan or equal to zero; and wherein the second parameter is derived froma first channel's first parameter and the third parameter is derivedfrom a second channel's first parameter.
 5. The network device of claim4 further comprising: the receiver further configured to receive afourth signal including a plurality of indications of buffer occupanciesassociated with the plurality of channels.
 6. A method performed by auser equipment (UE), the method comprising: receiving, from a networkdevice, a first signal including a first parameter corresponding to eachof a plurality of channels and a second signal including an allocationmessage for an uplink resource from the network device; allocating, by aprocessor, resources in response to the allocation message, whereinresources are allocated for data of each channel having a secondparameter above zero prior to another channel's data for transmissionhaving a third parameter less than or equal to zero; and wherein thesecond parameter is derived from a first channel's first parameter andthe third parameter is derived from a second channel's first parameter.7. The method of claim 6 further comprising: transmitting a third signalincluding a plurality of indications of buffer occupancies associatedwith the plurality of channels.
 8. The method of claim 6, wherein thesecond parameter is derived by multiplying the first channel's firstparameter with a fourth parameter and the third parameter is derived bymultiplying the second channel's first parameter with the fourthparameter.
 9. A method performed by a network device, the methodcomprising: transmitting, to a user equipment (UE), a first signalincluding a first parameter for each of a plurality of channels;transmitting a second signal including an allocation message for anuplink resource; receiving a third signal including data from theplurality of channels in response to the allocation message, whereinallocation of resources for the data of each channel having a secondparameter above zero is provided prior to another channel's data fortransmission having a third parameter less than or equal to zero; andwherein the second parameter is derived from a first channel's firstparameter and the third parameter is derived from a second channel'sfirst parameter.
 10. The method of claim 9 further comprising: receivinga fourth signal including a plurality of indications of bufferoccupancies associated with the plurality of channels.